Extremal graph theory

Results: 47



#Item
21A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia.

A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia.

Add to Reading List

Source URL: www.dsi.unive.it

Language: English - Date: 2010-08-27 12:03:59
22

"Zufällige Graphen und Extremal Graphen Theory" Humboldt-Universität zu Berlin, 6.-7. Juli 2007 Zeitplan: Freitag, 6. Juli[removed]:00

Add to Reading List

Source URL: asz.informatik.hu-berlin.de

Language: English - Date: 2007-07-11 07:21:10
23Microsoft Word - hw2_sampleanswer.doc

Microsoft Word - hw2_sampleanswer.doc

Add to Reading List

Source URL: www.cse.cuhk.edu.hk

Language: English - Date: 2009-11-24 06:25:28
24c Applied Mathematics E-Notes, [removed]), [removed] 
 Available free at mirror sites of http://www.math.nthu.edu.tw/∼amen/ ISSN[removed]

c Applied Mathematics E-Notes, [removed]), [removed] Available free at mirror sites of http://www.math.nthu.edu.tw/∼amen/ ISSN[removed]

Add to Reading List

Source URL: www.math.nthu.edu.tw

Language: English - Date: 2010-10-03 00:28:10
2506 a SP Vukicevic[removed]qxp

06 a SP Vukicevic[removed]qxp

Add to Reading List

Source URL: acta.chem-soc.si

Language: English - Date: 2010-09-18 04:50:51
26On the density of 2-colourable 3-graphs in which any four points span at most two edges Klas Markstr¨om and John Talbot October 3, 2008 Abstract Let

On the density of 2-colourable 3-graphs in which any four points span at most two edges Klas Markstr¨om and John Talbot October 3, 2008 Abstract Let

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:22
27Extremal hypersgraphs and bounds for the Turan density of the 4-uniform K5 Klas Markstr¨om October 14, 2008 Abstract In this paper we find, for n ≤ 16, the maximum number of edges

Extremal hypersgraphs and bounds for the Turan density of the 4-uniform K5 Klas Markstr¨om October 14, 2008 Abstract In this paper we find, for n ≤ 16, the maximum number of edges

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:22
28ON STABLE CYCLES AND CYCLE DOUBLE COVERS OF GRAPHS WITH LARGE CIRCUMFERENCE JONAS HÄGGLUND AND KLAS MARKSTRÖM Abstract. A cycle C in a graph is called stable if there exist no other cycle D in the same graph such that

ON STABLE CYCLES AND CYCLE DOUBLE COVERS OF GRAPHS WITH LARGE CIRCUMFERENCE JONAS HÄGGLUND AND KLAS MARKSTRÖM Abstract. A cycle C in a graph is called stable if there exist no other cycle D in the same graph such that

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:23
29Maria Chudnovsky. Photo by Dona Vukson, 2006  CMI profile Interview with Research Fellow Maria Chudnovsky

Maria Chudnovsky. Photo by Dona Vukson, 2006 CMI profile Interview with Research Fellow Maria Chudnovsky

Add to Reading List

Source URL: www2.maths.ox.ac.uk

Language: English - Date: 2007-10-03 11:36:14
30Cartesian coordinate system / Extremal graph theory / Edge coloring / Mathematics / Graph theory / Graph

Name Pd UNIT II: Worksheet[removed]Answer the following questions about the position/time graph to the right.

Add to Reading List

Source URL: modeling.asu.edu

Language: English - Date: 2013-01-16 12:34:45